On the girth and diameter of generalized Johnson graphs
نویسندگان
چکیده
منابع مشابه
The metric dimension and girth of graphs
A set $Wsubseteq V(G)$ is called a resolving set for $G$, if for each two distinct vertices $u,vin V(G)$ there exists $win W$ such that $d(u,w)neq d(v,w)$, where $d(x,y)$ is the distance between the vertices $x$ and $y$. The minimum cardinality of a resolving set for $G$ is called the metric dimension of $G$, and denoted by $dim(G)$. In this paper, it is proved that in a connected graph $...
متن کاملOn the diameter of generalized Kneser graphs
Let r , k be positive integers, s(< r), a nonnegative integer, and n=2r−s+k. The set of r-subsets of [n]={1, 2, . . . , n} is denoted by [n]r . The generalized Kneser graphK(n, r, s) is the graph whose vertex-set is [n]r where two r-subsets A and B are joined by an edge if |A ∩ B| s. This note determines the diameter of generalized Kneser graphs. More precisely, the diameter of K(n, r, s) is eq...
متن کاملGeneralized Girth Problems in Graphs and Hypergraphs
We study the asymptotic value of several extremal problems on graphs and hypergraphs, that arise as generalized notions of girth. Apart from being combinatorially natural questions, they are motivated by computational-theoretic applications. 1. An `-subgraph is a subgraph with ` edges per vertex, or equivalently, average degree 2`. What is the optimal upper bound S`(n, d), such that any graph o...
متن کاملOn Diameter of Line Graphs
The diameter of a connected graph $G$, denoted by $diam(G)$, is the maximum distance between any pair of vertices of $G$. Let $L(G)$ be the line graph of $G$. We establish necessary and sufficient conditions under which for a given integer $k geq 2$, $diam(L(G)) leq k$.
متن کاملOn Tensor Product of Graphs, Girth and Triangles
The purpose of this paper is to obtain a necessary and sufficient condition for the tensor product of two or more graphs to be connected, bipartite or eulerian. Also, we present a characterization of the duplicate graph $G 1 K_2$ to be unicyclic. Finally, the girth and the formula for computing the number of triangles in the tensor product of graphs are worked out.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2018
ISSN: 0012-365X
DOI: 10.1016/j.disc.2017.08.022